Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Interval Enclosures of Upper Bounds of Roundoff Errors using Semidefinite Programming
A longstanding problem related to floating-point implementation of numerical programs is to provide efficient yet precise analysis of output errors. We present a framework to compute lower bounds of absolute roundoff errors for numerical programs implementing polynomial functions with box constrained input variables. Our study relies on semidefinite programming (SDP) relaxations and is compleme...
متن کاملautomatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولNew Upper Bounds for Kissing Numbers from Semidefinite Programming
In geometry, the kissing number problem asks for the maximum number τn of unit spheres that can simultaneously touch the unit sphere in n-dimensional Euclidean space without pairwise overlapping. The value of τn is only known for n = 1, 2, 3, 4, 8, 24. While its determination for n = 1, 2 is trivial, it is not the case for other values of n. The case n = 3 was the object of a famous discussion ...
متن کاملDynamic Bounds on Stochastic Chemical Kinetic Systems Using Semidefinite Programming
The method of moments has been proposed as a potential means to reduce the dimensionality of the chemical master equation (CME) appearing in stochastic chemical kinetics. However, attempts to apply the method of moments to the CME usually result in the so-called closure problem. Several authors have proposed moment closure schemes, which allow them to obtain approximations of quantities of inte...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Mathematical Software
سال: 2018
ISSN: 0098-3500,1557-7295
DOI: 10.1145/3206430